Concise Derivation of Scattering Function from Channel Entropy Maximization
نویسندگان
چکیده
منابع مشابه
A derivation of the master equation from path entropy maximization.
The master equation and, more generally, Markov processes are routinely used as models for stochastic processes. They are often justified on the basis of randomization and coarse-graining assumptions. Here instead, we derive nth-order Markov processes and the master equation as unique solutions to an inverse problem. We find that when constraints are not enough to uniquely determine the stochas...
متن کاملOn Greedy Maximization of Entropy
Submodular function maximization is one of the key problems that arise in many machine learning tasks. Greedy selection algorithms are the proven choice to solve such problems, where prior theoretical work guarantees (1 − 1/e) approximation ratio. However, it has been empirically observed that greedy selection provides almost optimal solutions in practice. The main goal of this paper is to expl...
متن کاملConditional entropy maximization for PET
Maximum Likelihood (ML) estimation is extensively used for estimating emission densities from clumped and incomplete nzeasurement data in Positron Emission Tomography (PEU modality. Reconstruction produced by ML-algorithm has been found noisy because it does not make use of available prior knowledge. Bayesian estimation provides such a platform for the inclusion of prior knowledge in the recons...
متن کاملTsallis ’ entropy maximization procedure revisited
The proper way of averaging is an important question with regards to Tsal-lis' Thermostatistics. Three different procedures have been thus far employed in the pertinent literature. The third one, i.e., the Tsallis-Mendes-Plastino (TMP) [1] normalization procedure, exhibits clear advantages with respect to earlier ones. In this work, we advance a distinct (from the TMP-one) way of handling the L...
متن کاملKey Derivation without entropy loss
In reality, perfect source of randomness is hard to find. So, for real life applications, an imperfect source X of min-entropy k is converted into usable m-bit cryptographic key for some underlying application P . If P has security δ (against some class of attackes) with uniform random m-bit key, our goal is to design a key derivation function (KDF) h that allows us to use R = h(x) as the key f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2010
ISSN: 0090-6778
DOI: 10.1109/tcomm.2010.091310.090247